99 research outputs found
Are Diffusion Models Vulnerable to Membership Inference Attacks?
Diffusion-based generative models have shown great potential for image
synthesis, but there is a lack of research on the security and privacy risks
they may pose. In this paper, we investigate the vulnerability of diffusion
models to Membership Inference Attacks (MIAs), a common privacy concern. Our
results indicate that existing MIAs designed for GANs or VAE are largely
ineffective on diffusion models, either due to inapplicable scenarios (e.g.,
requiring the discriminator of GANs) or inappropriate assumptions (e.g., closer
distances between synthetic samples and member samples). To address this gap,
we propose Step-wise Error Comparing Membership Inference (SecMI), a
query-based MIA that infers memberships by assessing the matching of forward
process posterior estimation at each timestep. SecMI follows the common
overfitting assumption in MIA where member samples normally have smaller
estimation errors, compared with hold-out samples. We consider both the
standard diffusion models, e.g., DDPM, and the text-to-image diffusion models,
e.g., Latent Diffusion Models and Stable Diffusion. Experimental results
demonstrate that our methods precisely infer the membership with high
confidence on both of the two scenarios across multiple different datasets.
Code is available at https://github.com/jinhaoduan/SecMI.Comment: To appear in ICML 202
Using Caterpillar to Nibble Small-Scale Images
Recently, MLP-based models have become popular and attained significant
performance on medium-scale datasets (e.g., ImageNet-1k). However, their direct
applications to small-scale images remain limited. To address this issue, we
design a new MLP-based network, namely Caterpillar, by proposing a key module
of Shifted-Pillars-Concatenation (SPC) for exploiting the inductive bias of
locality. SPC consists of two processes: (1) Pillars-Shift, which is to shift
all pillars within an image along different directions to generate copies, and
(2) Pillars-Concatenation, which is to capture the local information from
discrete shift neighborhoods of the shifted copies. Extensive experiments
demonstrate its strong scalability and superior performance on popular
small-scale datasets, and the competitive performance on ImageNet-1K to recent
state-of-the-art methods
An Efficient Membership Inference Attack for the Diffusion Model by Proximal Initialization
Recently, diffusion models have achieved remarkable success in generating
tasks, including image and audio generation. However, like other generative
models, diffusion models are prone to privacy issues. In this paper, we propose
an efficient query-based membership inference attack (MIA), namely Proximal
Initialization Attack (PIA), which utilizes groundtruth trajectory obtained by
initialized in and predicted point to infer memberships.
Experimental results indicate that the proposed method can achieve competitive
performance with only two queries on both discrete-time and continuous-time
diffusion models. Moreover, previous works on the privacy of diffusion models
have focused on vision tasks without considering audio tasks. Therefore, we
also explore the robustness of diffusion models to MIA in the text-to-speech
(TTS) task, which is an audio generation task. To the best of our knowledge,
this work is the first to study the robustness of diffusion models to MIA in
the TTS task. Experimental results indicate that models with mel-spectrogram
(image-like) output are vulnerable to MIA, while models with audio output are
relatively robust to MIA. {Code is available at
\url{https://github.com/kong13661/PIA}}
A nomogram prediction model for lymph node metastasis risk after neoadjuvant chemoradiotherapy in rectal cancer patients based on SEER database
BackgroundRectal cancer patients who received neoadjuvant chemoradiotherapy (CRT) may have a lower cancer stage and a better prognosis. Some patients may be able to avoid invasive surgery. It is critical to accurately assess lymph node metastases (LNM) after neoadjuvant chemoradiotherapy. The goal of this study is to identify clinical variables associated with LNM and to develop a nomogram for LNM prediction in rectal cancer patients following nCRT.MethodsFrom 2010 to 2015, patients were drawn from the Surveillance, Epidemiology, and End Results (SEER) database. To identify clinical factors associated with LNM, the least absolute shrinkage and selection operator (LASSO) aggression and multivariate logistic regression analyses were used. To predict the likelihood of LNM, a nomogram based on multivariate logistic regression was created using decision curve analyses.ReslutThe total number of patients included in this study was 6,388. The proportion of patients with pCR was 17.50% (n=1118), and the proportion of patients with primary tumor pCR was 20.84% (n = 1,331). The primary tumor was pCR in 16.00% (n=213) of the patients. Age, clinical T stage, clinical N stage, and histology were found to be significant independent clinical predictors of LNM using LASSO and multivariate logistic regression analysis. The nomogram was developed based on four clinical factors. The 5-year overall survival rate was 78.9 percent for those with ypN- and 66.3 percent for those with ypN+, respectively (P<0.001).ConclusionPatients over 60 years old, with clinical T1-2, clinical N0, and adenocarcinoma may be more likely to achieve ypN0. The watch-and-wait (WW) strategy may be considered. Patients who had ypN0 or pCR had a better prognosis
Investigating and Mitigating the Side Effects of Noisy Views in Multi-view Clustering in Practical Scenarios
Multi-view clustering (MvC) aims at exploring category structures among
multi-view data without label supervision. Multiple views provide more
information than single views and thus existing MvC methods can achieve
satisfactory performance. However, their performance might seriously degenerate
when the views are noisy in practical scenarios. In this paper, we first
formally investigate the drawback of noisy views and then propose a
theoretically grounded deep MvC method (namely MvCAN) to address this issue.
Specifically, we propose a novel MvC objective that enables un-shared
parameters and inconsistent clustering predictions across multiple views to
reduce the side effects of noisy views. Furthermore, a non-parametric iterative
process is designed to generate a robust learning target for mining multiple
views' useful information. Theoretical analysis reveals that MvCAN works by
achieving the multi-view consistency, complementarity, and noise robustness.
Finally, experiments on extensive public datasets demonstrate that MvCAN
outperforms state-of-the-art methods and is robust against the existence of
noisy views
Improved Linear (hull) Cryptanalysis of Round-reduced Versions of SIMON
SIMON is a family of lightweight block ciphers designed by the U.S. National Security Agency (NSA) that has attracted much attention since its publication in 2013.
In this paper, we thoroughly investigate the properties of linear approximations of the bitwise AND operation with dependent input bits. By using a Mixed-integer Linear Programming based technique presented in Aasicrypt 2014 for automatic search for characteristics, we obtain improved linear characteristics for several versions of the SIMON family. Moreover, by employing a recently published method for automatic enumeration of differential and linear characteristics by Sun et. al., we present an improved linear hull analysis of some versions of the SIMON family, which are the best results for linear cryptanalysis of SIMON published so far.
Specifically, for SIMON, where the number denotes the block length, a 34-round linear characteristic with correlation is found, which is the longest linear characteristic that can be used in a key-recovery attack for SIMON published so far. Besides, several linear hulls superior to the best ones known previously are presented as follows: linear hulls for the 13-round SIMON with potential versus previous , for the 15-round SIMON with potential versus previous and linear hulls for the 21-round SIMON with potential versus previous
Mixed Integer Programming Models for Finite Automaton and Its Application to Additive Differential Patterns of Exclusive-Or
Inspired by Fu et al. work on modeling the exclusive-or differential property of the modulo addition as an mixed-integer programming problem, we propose a method with which any finite automaton can be formulated as an mixed-integer programming model. Using this method, we show how to construct a mixed integer programming model whose feasible region is the set of all differential patterns \u27s, such that . We expect that this may be useful in automatic differential analysis with additive difference
Towards Finding the Best Characteristics of Some Bit-oriented Block Ciphers and Automatic Enumeration of (Related-key) Differential and Linear Characteristics with Predefined Properties
In this paper, we investigate the Mixed-integer Linear Programming (MILP) modelling of the differential and linear behavior of a wide range of block ciphers. We point out that the differential behavior of an arbitrary S-box can be exactly described by a small system of linear inequalities.
~~~~~Based on this observation and MILP technique, we propose an automatic method for finding high probability (related-key) differential or linear characteristics of block ciphers. Compared with Sun {\it et al.}\u27s {\it heuristic} method presented in Asiacrypt 2014, the new method is {\it exact} for most ciphers in the sense that every feasible 0-1 solution of the MILP model generated by the new method corresponds to a valid characteristic, and therefore there is no need to repeatedly add valid cutting-off inequalities into the MILP model as is done in Sun {\it et al.}\u27s method; the new method is more powerful which allows us to get the {\it exact lower bounds} of the number of differentially or linearly active S-boxes; and the new method is more efficient which allows to obtain characteristic with higher probability or covering more rounds of a cipher (sometimes with less computational effort).
~~~~~Further, by encoding the probability information of the differentials of an S-boxes into its differential patterns, we present a novel MILP modelling technique which can be used to search for the characteristics with the maximal probability, rather than the characteristics with the smallest number of active S-boxes. With this technique, we are able to get tighter security bounds and find better characteristics.
~~~~~Moreover, by employing a type of specially constructed linear inequalities which can remove {\it exactly one} feasible 0-1 solution from the feasible region of an MILP problem, we propose a method for automatic enumeration of {\it all} (related-key) differential or linear characteristics with some predefined properties, {\it e.g.}, characteristics with given input or/and output difference/mask, or with a limited number of active S-boxes. Such a method is very useful in the
automatic (related-key) differential analysis, truncated (related-key) differential analysis, linear hull analysis, and the automatic construction of (related-key) boomerang/rectangle distinguishers.
~~~~~The methods presented in this paper are very simple and straightforward, based on which we implement a Python framework for automatic cryptanalysis, and extensive experiments are performed using this framework. To demonstrate the usefulness of these methods, we apply them to SIMON, PRESENT, Serpent, LBlock, DESL, and we obtain some improved cryptanalytic results
- …